length, num = [int(x) for x in input().split()]
if length == 1 and num == 0:
print(0,0)
elif num == 0 or num > length * 9:
print(-1,-1)
else:
dp = [0] * (length - 1) + [1]
for x in range(len(dp)):
dp[x] += min(9,num - sum(dp))
a = int("".join(list(reversed([str(x) for x in dp]))))
dp = [0] * length
for x in range(len(dp)):
dp[x] += min(9,num - sum(dp))
b = "".join([str(x) for x in dp])
print(a,b)#include<bits/stdc++.h>
using namespace std;
int a[105];
int b[105];
int main(){
int m , s , x;
cin>>m>>s;
x = s;
if(m == 1 && s == 0){
cout<<0<<" "<<0;
return 0;
}
if(s == 0||s > m * 9){
cout<<-1<<" "<<-1;
return 0;
}
while(s != 0){
if(a[1] == 0){
a[1] = 1;
s--;
continue;
}
for(int i = m ; i >= 1 ;){
if(a[i] != 9){
a[i] ++ ;
s--;
break;
}else{
i--;
}
}
}
for(int i = 1 ; i <= m ; i++) cout<<a[i];
cout<<" ";
while(x != 0){
for(int i = 1 ; i <= m ;){
if(b[i] != 9){
b[i] ++ ;
x--;
break;
}else{
i++;
}
}
}
for(int i = 1 ; i <= m ; i++) cout<<b[i];
}Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |